Representable orientations of the free spikes

Enumerating orientations of the free spikes

We show that there are exactly 2Dk inequivalent orientations of the rank-k free spike (k ≥ 4) where Dk is the k th Dedekind number. Our proof of this result is constructive and employs the monotone boolean functions.

Semi-transitive orientations and word-representable graphs

On Representable Graphs, Semi-transitive Orientations, and the Representation Numbers

A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) ∈ E for each x 6= y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. It was shown in [4] that a graph is representable if and only if it is k-representable for some k. Minimum k for which a representabl...

ideological and cultural orientations in translation of narrative text: the case of hajji baba of isfahan

در میان عواملی که ممکن است ذهن مترجم را هنگام ترجمه تحت تأثیر قرار دهند، می توان به مقوله انتقال ایدئولوژی از طریق متن یا گفتمان اشاره کرد. هدف از این تحقیق تجزیه و تحلیل جنبه های ایدئولوژیکی و فرهنگی متن مبدأ انگلیسی نوشته جیمز موریه تحت عنوان سرگذشت حاجی بابای اصفهانی ( 1823) و ترجمه فارسی میرزا حبیب اصفهانی(1880) بوده است.

On Semi-transitive Orientations and Graphs Representable by Words

A graph G = (V, E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) ∈ E for each x 6= y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. The minimum k for which a representable graph G is k-representable is called its representation number. In this paper we give a char...